Time Slotted Moving Window - a New Policing Mechanism for High Speed Networks

This paper describes a window-based policing mechanism, called Time Slotted Moving Window. Its key idea consists in aggregating the arrival events computation in order to minimize the processing and buffering requirements. Its main characteristics are simplicity, low implementation complexity, memory saving and use of a single low precision timer. Its performance behavior ranges from jumping window to sliding window results. Simulation and implementation results considering geometric and bursty traffics are obtained for comparison purpose. The comparative analysis concentrates on the number of timers and their precision, the maximum burst duration, the required memory and the violation probability. Furthermore, the mechanisms were implemented in UNIX and DOS environment using a high performance implementation architecture. The results confirm proposed mechanism efficiency.